Polymorphic Syntax Definition
نویسنده
چکیده
Context-free grammars can be used in algebraic speciication instead of rst-order signatures to deene the structure of algebras. The rigidity of these rst-order structures enforces a choice between strongly typed structures with little gener-icity or generic operations over untyped structures. Two-level signatures provide a better balance between genericity and typing. Two-level grammars are the grammatical counterpart of two-level signatures. The paper discusses generic polymorphic syntax deenition in context-free grammars and two-level grammars and investigates the problems for the practical usage of two-level grammars as signatures in algebraic speciication formalisms.
منابع مشابه
Polymorphic Abstract Syntax via Grothendieck Construction
Abstract syntax with variable binding is known to be characterised as an initial algebra in a presheaf category. This paper extends it to the case of polymorphic typed abstract syntax with binding. We consider two variations, secondorder and higher-order polymorphic syntax. The central idea is to apply Fiore’s initial algebra characterisation of typed abstract syntax with binding repeatedly, i....
متن کاملSyntax vs. semantics: competing approaches to dynamic network intrusion detection
Malicious network traffic, including widespread worm activity, is a growing threat to Internet-connected networks and hosts. In this paper, we consider two competing approaches to dynamic network intrusion detection: syntax based and semantics based approaches. For the syntax driven approach, we propose two sliding window based schemes to generate potential worm signatures automatically. Since ...
متن کاملMultiversal Polymorphic Algebraic Theories
We formalise and study the notion of polymorphic algebraic theory, as understood in the mathematical vernacular as a theory presented by equations between polymorphically-typed terms with both type and term variable binding. The prototypical example of a polymorphic algebraic theory is System F, but our framework applies more widely. The extra generality stems from a mathematical analysis that ...
متن کاملA Syntax Definition Method for Vi - sual Specification Languages
Today, the syntax of visual specification languages such as UML is typically defined using metamodeling techniques. However, this kind of syntax definition has drawbacks. In particular, graphic metamodels are not powerful enough, so they must be augmented by a constraint language. In this report, we present a text-based technique for the syntax definition of a graphic specification language. We...
متن کاملRigorous EBNF-based Definition for a Graphic Modeling Language
Today, the syntax of visual specification languages such as UML is typically defined using meta-modelling techniques. However, this kind of syntax definition has drawbacks. In particular, graphic meta-models are not powerful enough, so they must be augmented by a textual constraint language. As an alternative, we present in this paper, a text-based technique for the syntax definition of a graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 199 شماره
صفحات -
تاریخ انتشار 1998